Перевод: со всех языков на все языки

со всех языков на все языки

adaptive binary arithmetic decoding process

См. также в других словарях:

  • Arithmetic coding — is a method for lossless data compression. Normally, a string of characters such as the words hello there is represented using a fixed number of bits per character, as in the ASCII code. Like Huffman coding, arithmetic coding is a form of… …   Wikipedia

  • процесс адаптивного арифметического бинарного декодирования — Энтропийный декодирующий процесс, который извлекает значения бинов из потока битов, создаваемого процессом адаптивного арифметического бинарного кодирования (МСЭ Т Н.264). [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики… …   Справочник технического переводчика

  • Unified Video Decoder — The Unified Video Decoder, previously called Universal Video Decoder , or UVD in short, is the video decoding unit from ATI Technologies to support hardware decode of H.264 and VC 1 video codec standards, and being a part of AVIVO HD… …   Wikipedia

  • H.264/MPEG-4 AVC — H.264 is a standard for video compression. It is also known as MPEG 4 Part 10, or MPEG 4 AVC (for Advanced Video Coding). As of 2008, it is the latest block oriented motion compensation based codec standard developed by the ITU T Video Coding… …   Wikipedia

  • Huffman coding — Huffman tree generated from the exact frequencies of the text this is an example of a huffman tree . The frequencies and codes of each character are below. Encoding the sentence with this code requires 135 bits, as opposed of 288 bits if 36… …   Wikipedia

  • Information theory — Not to be confused with Information science. Information theory is a branch of applied mathematics and electrical engineering involving the quantification of information. Information theory was developed by Claude E. Shannon to find fundamental… …   Wikipedia

  • JPEG — For other uses, see JPEG (disambiguation). Joint Photographic Experts Group A photo of a cat compressed with successively more lossy compression ratios from right to left Filename extension .jpg …   Wikipedia

  • DEFLATE — redirects here. For other uses, see Deflation (disambiguation). Deflate is a lossless data compression algorithm that uses a combination of the LZ77 algorithm and Huffman coding. It was originally defined by Phil Katz for version 2 of his PKZIP… …   Wikipedia

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… …   Wikipedia

  • Golomb coding — is a data compression scheme invented by Solomon W. Golomb in the 1960s. The scheme is based on entropy encoding and is optimal (in the sense of Shannon s source coding theorem) for alphabets following a geometric distribution, making it highly… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»